IRIT / RT – 2009 - 2 – FR A semantics for an event based generic tableau prover ( long version )

نویسندگان

  • Olivier Gasquet
  • Bilal Said
  • François Schwarzentruber
چکیده

Unless one strictly uses standard modal logics, there is a need for a generic tool allowing easy implementation of provers or model builders for most of multi modal logics. This is what LoTREC aims at. It offers a high-level language for describing tableaux calculi specified by means of rules rewriting patterns together with a strategy specifying the order in which rules have to be applied. However, a naive implementation of the search of patterns to be rewritten would be sub-optimal. LoTREC’s engine has a built-in optimised way of finding them. In this paper we give the semantics of rule application and prove the correctness of their optimised treatment.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Tableau Workbench

The Tableau Workbench (TWB) is a generic framework for building automated theorem provers for arbitrary propositional logics. The TWB has a small core that defines its general architecture, some extra machinery to specify tableau-based provers and an abstraction language for expressing tableau rules. This language allows users to “cut and paste” tableau rules from textbooks and to specify a sea...

متن کامل

A Tableau Prover for Natural Logic and Language

Modeling the entailment relation over sentences is one of the generic problems of natural language understanding. In order to account for this problem, we design a theorem prover for Natural Logic, a logic whose terms resemble natural language expressions. The prover is based on an analytic tableau method and employs syntactically and semantically motivated schematic rules. Pairing the prover w...

متن کامل

An Efficient Tableau Prover using Global Caching for the Description Logic ALC

We report on our implementation of a tableau prover for the description logic ALC, which is based on the EXPTIME tableau algorithm using global caching for ALC that was developed jointly by us and Goré [10]. The prover, called TGC for “Tableaux with Global Caching”, checks satisfiability of a set of concepts w.r.t. a set of global assumptions by constructing an and-or graph, using tableau rules...

متن کامل

MetTeL: A Tableau Prover with Logic-Independent Inference Engine

MetTeL is a generic tableau prover for various modal, intuitionistic, hybrid, description and metric logics. The core component of MetTeL is a logic-independent tableau inference engine. A novel feature is that users have the ability to flexibly specify the set of tableau rules to be used in derivations. Termination can be achieved via a generalisation of a standard loop checking mechanism or u...

متن کامل

A Tableau Decision Procedure for Propositional Intuitionistic Logic

The contribution of this paper consists in some techniques to bound the proof search space in propositional intuitionistic logic. These techniques are justified by Kripke semantics and they are the backbone of a tableau based theorem prover (PITP) implemented in C++ language. PITP and some known theorem provers are compared by the formulas of ILTP v1.1.1 benchmark library. It turns out that PIT...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009